Integer constraints to stop deforestation
Identifieur interne : 000276 ( LNCS/Analysis ); précédent : 000275; suivant : 000277Integer constraints to stop deforestation
Auteurs : Helmut Seidl [Allemagne]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 1996.
Abstract
Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.
Url:
DOI: 10.1007/3-540-61055-3_46
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 001113
- to stream Istex, to step Curation: 001002
- to stream Istex, to step Checkpoint: 001051
- to stream Main, to step Merge: 002C51
- to stream Main, to step Curation: 002777
- to stream Main, to step Exploration: 002777
- to stream LNCS, to step Extraction: 000276
Links to Exploration step
ISTEX:795351154C8A996243C163A93C5232FB45505B2ELe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Integer constraints to stop deforestation</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:795351154C8A996243C163A93C5232FB45505B2E</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1007/3-540-61055-3_46</idno><idno type="url">https://api.istex.fr/document/795351154C8A996243C163A93C5232FB45505B2E/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">001113</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">001113</idno><idno type="wicri:Area/Istex/Curation">001002</idno><idno type="wicri:Area/Istex/Checkpoint">001051</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001051</idno><idno type="wicri:doubleKey">0302-9743:1996:Seidl H:integer:constraints:to</idno><idno type="wicri:Area/Main/Merge">002C51</idno><idno type="wicri:Area/Main/Curation">002777</idno><idno type="wicri:Area/Main/Exploration">002777</idno><idno type="wicri:Area/LNCS/Extraction">000276</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Integer constraints to stop deforestation</title><author><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name><affiliation></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Allemagne</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>1996</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">795351154C8A996243C163A93C5232FB45505B2E</idno><idno type="DOI">10.1007/3-540-61055-3_46</idno><idno type="ChapterID">21</idno><idno type="ChapterID">Chap21</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding is introduced to avoid repeated unfolding of the same expression. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. We show that such an analysis can be obtained from a control flow analysis by an extension with integer constraints — essentially at no loss in efficiency.</div></front></TEI><affiliations><list><country><li>Allemagne</li></country></list><tree><country name="Allemagne"><noRegion><name sortKey="Seidl, Helmut" sort="Seidl, Helmut" uniqKey="Seidl H" first="Helmut" last="Seidl">Helmut Seidl</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/LNCS/Analysis
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000276 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/LNCS/Analysis/biblio.hfd -nk 000276 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Rhénanie
|area= UnivTrevesV1
|flux= LNCS
|étape= Analysis
|type= RBID
|clé= ISTEX:795351154C8A996243C163A93C5232FB45505B2E
|texte= Integer constraints to stop deforestation
}}
| This area was generated with Dilib version V0.6.31. |  |